Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
نویسندگان
چکیده
Abstract In this paper, we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) sinc as its application. The computation of NNFFT is mainly based on nodes equispaced frequencies (NFFT). employs two compactly supported, continuous window functions. For fixed nonharmonic bandwidth, show that error $$\sinh$$ sinh -type functions has an exponential decay respect to truncation parameters used As important application NNFFT, present transform. estimated well.
منابع مشابه
Fast Fourier Transforms for Nonequispaced Data
A group of algorithms is presented generalizing the fast Fourier transform to the case of nonin-teger frequencies and nonequispaced nodes on the interval [-r, r]. The schemes of this paper are based on a combination of certain analytical considerations with the classical fast Fourier transform and generalize both the forward and backward FFTs. Each of the algorithms requires O(N log N + N-log(I...
متن کاملNumerical stability of nonequispaced fast Fourier transforms
This paper presents some new results on numerical stability for multivariate fast Fourier transform of nonequispaced data (NFFT). In contrast to fast Fourier transform (of equispaced data), the NFFT is an approximate algorithm. In a worst case study, we show that both approximation error and roundoff error have a strong influence on the numerical stability of NFFT. Numerical tests confirm the t...
متن کاملChapter 1 Fast Fourier Transforms for Nonequispaced Data: a Tutorial
In this section, we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequi-spaced data (NDFT) in the time domain and in the frequency domain. In particular, we are interested in the approximation error as function of the arithmetic complexity of the algorithm. We discuss the robustness of NDFT{algorithms with respect to roundoo errors and...
متن کاملParticle Simulation Based on Nonequispaced Fast Fourier Transforms
The fast calculation of long-range interactions is a demanding problem in particle simulation. The main focus of our approach is the decomposition of the problem in building blocks and present efficient numerical realizations for these blocks. For that reason we recapitulate the fast Fourier transform at nonequispaced nodes and the fast summation method. We describe the application of these alg...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2022
ISSN: ['1017-1398', '1572-9265']
DOI: https://doi.org/10.1007/s11075-022-01389-6